Vector coding algorithms for multidimensional discrete Fourier transform
نویسندگان
چکیده
منابع مشابه
Discrete wavelet transform implementation in Fourier domain for multidimensional signal
Wavelet transforms are often calculated by using the Mallat algorithm. In this algorithm, a signal is decomposed by a cascade of filtering and downsampling operations. Computing time can be important but the filtering operations can be speeded up by using fast Fourier transform (FFT)-based convolutions. Since it is necessary to work in the Fourier domain when large filters are used, we present ...
متن کاملOctonion Discrete Fourier Transform : Fast Algorithms
The color image from one of the color models, for instance the RGB model, can be transformed into the quaternion algebra and be represented as one quaternion image which allows to process simultaneously of all color components of the image. The color image can be also considered in different models with transformation to the octonion space with following processing in the 8-D frequency domain...
متن کاملA Method for Validating Multidimensional Fast Fourier Transform (FFT) Algorithms,
A method is described for validating fast Fourier transforms (FFTs) based on the use of simple input fiinctions whose discrete Fourier transforms can be evaluated in closed form. Explicit analytical results are developed for one-dimensional and two-dimensional discrete Fourier transforms. The analytical results are easily generalized to higher dimensions. The results offer a means for validatin...
متن کاملShort Vector Code Generation for the Discrete Fourier Transform
In this paper we use a mathematical approach to automatically generate high performance short vector code for the discrete Fourier transform (DFT). We represent the well-known Cooley-Tukey fast Fourier transform in a mathematical notation and formally derive a “short vector variant”. Using this recursion we generate for a given DFT a large number of different algorithms, represented as formulas...
متن کاملThe Discrete Fourier Transform in Coding and Cryptography
| Some applications of the Discrete Fourier Transform (DFT) in coding and in cryptography are described. The DFT over general commutative rings is introduced and the condition for its existence given. Blahut's Theorem, which relates the DFT to linear complexity, is shown to hold unchanged in general commutative rings. I. The (Usual) Discrete Fourier Transform Let be a primitive N th root of uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2008
ISSN: 0377-0427
DOI: 10.1016/j.cam.2006.11.025